Unified approach for solving exit problems for additive-increase and multiplicative-decrease processes

نویسندگان

چکیده

Abstract We analyse an additive-increase and multiplicative-decrease (also known as growth–collapse) process that grows linearly in time that, at Poisson epochs, experiences downward jumps are (deterministically) proportional to its present position. For this process, also for reflected versions, we consider one- two-sided exit problems concern the identification of laws times from fixed intervals half-lines. All proofs based on a unified first-step analysis approach first jump epoch, which allows us give explicit, yet involved, formulas their Laplace transforms. eight transforms can be described terms two so-called scale functions associated with upward one-sided time. other obtained above by taking limits, derivatives, integrals, combinations these.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

GENEVA: Streaming Control Algorithm Using Generalized Multiplicative-increase/additive-decrease

Motivated by the deployment of wide-area high-speed networks, we propose GENEVA, the streaming control algorithm using generalized multiplicative-increase/additive-decrease (GMIAD). Because current typical congestion controllers such as a TCP-friendly rate control prevent occurrences of network congestion reacting susceptibly to packet loss, it causes a significant degradation of streaming qual...

متن کامل

An efficient approach for solving layout problems

This paper offers an approach that could be useful for diverse types of layout problems or even area allocation problems. By this approach there is no need to large number of discrete variables and only by few continues variables large-scale layout problems could be solved in polynomial time. This is resulted from dividing area into discrete and continuous dimensions. Also defining decision var...

متن کامل

A NEW APPROACH FOR SOLVING FULLY FUZZY QUADRATIC PROGRAMMING PROBLEMS

Quadratic programming (QP) is an optimization problem wherein one minimizes (or maximizes) a quadratic function of a finite number of decision variable subject to a finite number of linear inequality and/ or equality constraints. In this paper, a quadratic programming problem (FFQP) is considered in which all cost coefficients, constraints coefficients, and right hand side are characterized by ...

متن کامل

A new approach for solving neutrosophic integer programming problems

Linear programming is one of the most important usages of operation research methods in real life, that includes of one objective function and one or several constraints which can be in the form of equality and inequality. Most of the problems in the real world are include of inconsistent and astute uncertainty, because of this reason we can’t obtain the optimal solution easily. In this paper, ...

متن کامل

A dynamic programming approach for solving nonlinear knapsack problems

Nonlinear Knapsack Problems (NKP) are the alternative formulation for the multiple-choice knapsack problems. A powerful approach for solving NKP is dynamic programming which may obtain the global op-timal solution even in the case of discrete solution space for these problems. Despite the power of this solu-tion approach, it computationally performs very slowly when the solution space of the pr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Applied Probability

سال: 2022

ISSN: ['1475-6072', '0021-9002']

DOI: https://doi.org/10.1017/jpr.2022.27